Core XACML and Term Rewriting

We define a notion of “core” XACML and show how these can be represented as ground associativee-commutative term rewriting systems with strategies

Equality between Functionals in the Presence of Coproducts

AbstractWe consider the lambda calculus obtained from the simply typed calculus by adding products, coproducts, and a terminal type. We prove the following theorem: The equations provable in this calculus are precisely those true in any set-theoretic model with an infinite base type

A Hybrid Analysis for Security Protocols with State

Cryptographic protocols rely on message-passing to coordinate activity among principals. Each principal maintains local state in individual local sessions only as needed to complete that session. However, in some protocols a principal also uses state to coordinate its different local sessions. Sometimes the non-local, mutable state is used as a means, for example with smart cards or Trusted Platform Modules. Sometimes it is the purpose of running the protocol, for example in commercial transactions. Many richly developed tools and techniques, based on well-understood foundations, are available for design and analysis of pure message-passing protocols. But the presence of cross-session state poses difficulties for these techniques. In this paper we provide a framework for modeling stateful protocols. We define a hybrid analysis method. It leverages theorem-proving---in this instance, the PVS prover---for reasoning about computations over state. It combines that with an "enrich-by-need" approach---embodied by CPSA---that focuses on the message-passing part. As a case study we give a full analysis of the Envelope Protocol, due to Mark Ryan

An Improved Algorithm for Generating Database Transactions from Relational Algebra Specifications

Alloy is a lightweight modeling formalism based on relational algebra. In prior work with Fisler, Giannakopoulos, Krishnamurthi, and Yoo, we have presented a tool, Alchemy, that compiles Alloy specifications into implementations that execute against persistent databases. The foundation of Alchemy is an algorithm for rewriting relational algebra formulas into code for database transactions. In this paper we report on recent progress in improving the robustness and efficiency of this transformation

Unexpected Structures for Intercalation of Sodium in Epitaxial Graphene-SiC Interfaces

We show using scanning tunneling microscopy, spectroscopy, and ab initio calculations that several intercalation structures exist for Na in epitaxial graphene on SiC(0001). Intercalation takes place at room temperature and Na electron-dopes the graphene. It intercalates in-between single-layer graphene and the carbon-rich interfacial layer. It also penetrates beneath the interfacial layer and decouples it to form a second graphene layer. This decoupling is accelerated by annealing and is verified by direct Na deposition onto the interface layer. Our observations show that intercalation in graphene is fundamentally different than in graphite and is a versatile means of electronic control.Comment: 10 pages text, 2 pages, references, and 4 figure page

GPS Modeling for Designing Aerospace Vehicle Navigation Systems

The complexity of the design of a Global Positioning System (GPS) user segment, as well as the performance demanded of the components, depends on user requirements such as total navigation accuracy. Other factors, for instance the expected satellite/vehicle geometry or the accuracy of an accompanying inertial navigation system can also affect the user segment design. Models of GPS measurements are used to predict user segment performance at various levels. Design curves are developed which illustrate the relationship between user requirements, the user segment design, and component performance

A Realizability Interpretation for Intersection and Union Types

International audienceProof-functional logical connectives allow reasoning about the structure of logical proofs, in this way giving to the latter the status of first-class objects. This is in contrast to classical truth-functional con- nectives where the meaning of a compound formula is dependent only on the truth value of its subformulas.In this paper we present a typed lambda calculus, enriched with strong products, strong sums, and a related proof-functional logic. This cal- culus, directly derived from a typed calculus previously defined by two of the current authors, has been proved isomorphic to the well-known Barbanera-Dezani-Ciancaglini-de’Liguoro type assignment system. We present a logic L∩∪ featuring two proof-functional connectives, namely strong conjunction and strong disjunction. We prove the typed calculus to be isomorphic to the logic L∩∪ and we give a realizability semantics using Mints’ realizers [Min89] and a completeness theorem. A prototype implementation is also described